package com.lei.leetcode;

/**
 * @Author LeiXiaoLei
 * @Date 2022/9/1 20:40
 * @Version 1.0
 */
public class S_387 {
    public int firstUniqChar(String s) {
        int[] freq = new int[26];
        for (int i = 0; i < s.length(); i++) {
            freq[s.charAt(i) - 'a']++;
        }

        for (int i = 0; i < s.length(); i++) {
            if (freq[s.charAt(i) - 'a'] == 1) return i;
        }
        return -1;
    }
}
